A hidden Markov model for progressive multiple alignment
نویسندگان
چکیده
منابع مشابه
A hidden Markov model for progressive multiple alignment
MOTIVATION Progressive algorithms are widely used heuristics for the production of alignments among multiple nucleic-acid or protein sequences. Probabilistic approaches providing measures of global and/or local reliability of individual solutions would constitute valuable developments. RESULTS We present here a new method for multiple sequence alignment that combines an HMM approach, a progre...
متن کاملHidden Markov Tree Model for Word Alignment
We propose a novel unsupervised word alignment model based on the Hidden Markov Tree (HMT) model. Our model assumes that the alignment variables have a tree structure which is isomorphic to the target dependency tree and models the distortion probability based on the source dependency tree, thereby incorporating the syntactic structure from both sides of the parallel sentences. In English-Japan...
متن کاملMultiple Alignment Using Hidden Markov Models
A simulated annealing method is described for training hidden Markov models and producing multiple sequence alignments from initially unaligned protein or DNA sequences. Simulated annealing in turn uses a dynamic programming algorithm for correctly sampling suboptimal multiple alignments according to their probability and a Boltzmann temperature factor. The quality of simulated annealing alignm...
متن کاملMultiple Alignment with Hidden Markov Models
Multiple alignment of sequences is an important problem in bioinformatics. For example, multiple alignment of proteins belonging to the same family can provide valuable information for the common protein structure. Looking at a multiple alignment one can identify patterns which are not obvious if one looks at just pairwise alignments between members of the family. Traditional alignment schemes ...
متن کاملA context dependent pair hidden Markov model for statistical alignment.
This article proposes a novel approach to statistical alignment of nucleotide sequences by introducing a context dependent structure on the substitution process in the underlying evolutionary model. We propose to estimate alignments and context dependent mutation rates relying on the observation of two homologous sequences. The procedure is based on a generalized pair-hidden Markov structure, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2003
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btg193